An O(log k)-competitive algorithm for generalized caching
نویسندگان
چکیده
In the generalized caching problem, we have a set of pages and a cache of size k. Each page p has a size wp ≥ 1 and fetching cost cp for loading the page into the cache. At any point in time, the sum of the sizes of the pages stored in the cache cannot exceed k. The input consists of a sequence of page requests. If a page is not present in the cache at the time it is requested, it has to be loaded into the cache incurring a cost of cp. We give a randomized O(log k)-competitive online algorithm for the generalized caching problem, improving the previous bound of O(log k) by Bansal, Buchbinder, and Naor (STOC’08). This improved bound is asymptotically tight and of the same order as the known bounds for the classic problem with uniform weights and sizes. We follow the LP based techniques proposed Bansal et al. and our main contribution are improved and slightly simplified methods for rounding fractional solutions online.
منابع مشابه
Online Companion Caching
This paper is concerned with online caching algorithms for the (n, k)-companion cache, defined by Brehob et. al. [3]. In this model the cache is composed of two components: a k-way set-associative cache and a companion fully-associative cache of size n. We show that the deterministic competitive ratio for this problem is (n+1)(k+1)−1, and the randomized competitive ratio is O(log n log k) and Ω...
متن کاملGeneral Caching with Lifetimes
We consider the problem of caching with lifetimes, where a lifetime is specified whenever a page is loaded into the cache. The copy of a page loaded into the cache may be used to serve requests to the same page, only until its expiration time. We present a generic method to get an algorithm for caching with lifetimes, from an algorithm for caching without lifetimes. This method works for any co...
متن کاملPractical and Theoretical Issues in Prefetching and Caching
This thesis has two parts, the rst more practical, and the second more theoretical. The rst part considers informed prefetching and caching in which an application provides information about its upcoming I/O accesses to the operating system, allowing the system to prefetch data and to make informed cache replacement decisions. I compare existing algorithms for this problem using trace-driven si...
متن کاملWhat To Do With Your Free Time: Algorithms for Infrequent Requests and Randomized Weighted Caching
We consider an extension of the standard on-line model to settings in which an on-line algorithm has free time between successive requests in an input sequence. During this free time, the algorithm may perform operations without charge before receiving the next request. For instance, in planning the motion of re trucks, there may be time in between res that one could use to reposition the truck...
متن کاملAn O(log k log^2 n)-competitive Randomized Algorithm for the k-Sever Problem
In this paper, we show that there is an O(log k log n)-competitive randomized algorithm for the k-sever problem on any metric space with n points, which improved the previous best competitive ratio O(log k log n log log n) by Nikhil Bansal et al. (FOCS 2011, pages 267276).
متن کامل